An Improved WBF Algorithm for Higher-Speed Decoding of LDPC Codes
نویسندگان
چکیده
Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF) algorithm. Specifically, based on the stochastic error bitmap of the received vector, a partially parallel bit-choose strategy is adopted to lower the delay of choosing the bit flipped. Because of its partially parallel structure, the novel strategy can be well incorporated into the LDPC decoder [1]. The analysis of the decoding delay demonstrates that, the decoding speed can be greatly improved by adopting the proposed FWBF algorithm. Further, simulation results verify the validity of the proposed algorithm.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSelf Reliability based Weighted Bit-Flipping Decoding for Low-density Parity-check Codes
Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme...
متن کاملReliability ratio based weighted bit-flipping decoding for low-density parity-check codes - Electronics Letters
Introduction: The family of low-density parity-check (LDPC) codes proposed by Gallager [1] has attracted substantial research interest in the information theory community. LDPC codes can be decoded using various decoding schemes [1–4] such as hard-decisions, softdecisions and hybrid decoding schemes. The high-complexity sum-product algorithm (SPA) was shown to achieve a near-capacity performanc...
متن کاملComparison of Simplified Gradient Descent Algorithms for Decoding Ldpc Codes
In this paper it is shown that multi GDBF algorithm exhibits much faster convergence as compared to the single GDBF algorithm. The multi GDBF algorithm require less iterations when compared to the single GDBF algorithm for the search point to closely approach the local maximum point taking into consideration the gradient descent bit flipping (GDBF) algorithms exhibiting better decoding performa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1206.3362 شماره
صفحات -
تاریخ انتشار 2012